https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8770 Wed 11 Apr 2018 16:37:45 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:4319 Wed 11 Apr 2018 16:02:38 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:4975 Wed 11 Apr 2018 09:35:56 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:9241 Sat 24 Mar 2018 11:12:48 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8038 Sat 24 Mar 2018 08:35:04 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11283 t and girth at least g ≥ t + 1. The set of all the graphs of order n, containing no cycles of length ≤ t, and of size ex(n; t), is denoted by EX(n; t) = EX(n; {C₃,C₄, . . . ,Cᵼ }), these graphs are called EX graphs. In 1975, Erdős proposed the problem of determining the extremal numbers ex(n; 4) of a graph of order n and girth at least 5. In this paper, we consider a generalized version of this problem, for t ≥ 5. In particular, we prove that ex(29; 6) = 45, also we improve some lower bounds and upper bounds of exᴜ(n; t), for some particular values of n and t.]]> Sat 24 Mar 2018 08:12:43 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11783 Sat 24 Mar 2018 08:07:34 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5919 Sat 24 Mar 2018 07:46:46 AEDT ]]>